Phrases Boolean algebra Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

Phrases
Previous Year Questions

Phrases
Previous Year Questions
Phrases

Phrases Previous Year Questions (PYQs)

Phrases Boolean Algebra PYQ

Qus : 1

Which one of the following Boolean algebraic rule is correct?

1
2
3
4
Go to Discussion

Solution

A + A'B = (A + A') . (A + B)

= 1 . (A + B)

= A + B

Qus : 2

Which term is redundant in the expression AB + A'C + BC ?

1
2
3
4
Go to Discussion

Solution

Qus : 3

The total number binary function that can be defined using n Boolean variables is

1
2
3
4
Go to Discussion

Solution

Qus : 4

Assume x' represents negation of x the Boolean function x'y' + xy + x'y is equivalent to?

1
2
3
4
Go to Discussion

Solution

Qus : 5

The equivalence of given expression x+x'y with Boolean theorem is….

1
2
3
4
Go to Discussion

Solution

x+x'y

=(x+x')(x+y)

=(x+y)

Qus : 6

Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is

1
2
3
4
Go to Discussion

Solution

Qus : 7

Cosider the following Boolean Expression for F:

$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .

The minimum sum of products form of F is

1
2
3
4
Go to Discussion

Solution

Qus : 8

The number of minterms in a

$n$ variable truth tableis

1
2
3
4
Go to Discussion

Solution

Qus : 9

Let

$\oplus$ and

$\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?

1
2
3
4
Go to Discussion

Solution

Qus : 10

The reduced form of the Boolean function

$F=xyz+xyz^{\prime}^{}+x^{\prime}yz+xy^{\prime}z$ is

1
2
3
4
Go to Discussion

Solution

Qus : 11

How many Boolean expressions can be be formed with 3 Boolean variables?

1
2
3
4
Go to Discussion

Solution

Qus : 12

The minimum number of NAND gates required for implementing the Boolean expression

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

1
2
3
4
Go to Discussion

Solution

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

$AB+AB'C+AB'C'$

$AB+AB'(C+C')$

$AB+AB'$

$A(B+B')$

Qus : 13

Which of the following is equivalent to the Boolean expression:

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

1
2
3
4
Go to Discussion

Solution

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

$(X+Y)(X+Y')(X'+Y)$

$(XX+XY+YX+YY')(X'+Y)$

$(X+XY)(X'+Y)$

$X(1+Y)(X'+Y)$

$X(X'+Y)$

$XX'+XY$

$XY$

Qus : 14

Write the simplified form of the Boolean expression

(A+C)(AD+AD')+AC+C

1
2
3
4
Go to Discussion

Solution

(A+C)(AD+AD')+AC+C

=(A+C)A(D+D')+C(A+1)

=(A+C)+C

=A+C

Qus : 15

The Boolean expression AB+ AB' + A'C + AC is unaffected by the value of the Boolean variable

1
2
3
4
Go to Discussion

Solution

$\begin{array}{ll}{A(B+\overline{B})+C(A+\overline{A})} \\ {A+C}\, \end{array}$

Qus : 16

If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):

1
2
3
4
Go to Discussion

Solution

Output is high if any of the input is low. The truth table for NAND gate is:

A	B	Output
0	0	0
0	1	1
1	0	1
1	1	1

Table representing NAND Gate.

Qus : 17

The number of terms in the product of sums canonical form of

1
2
3
4
Go to Discussion

Solution

Qus : 18

Consider the following min term expression for F.

F(P,Q,R,S) = ∑ (0, 2, 5, 7, 8, 10, 13, 15)

The minterms 2, 7, 8 and 13 are ‘do not care' terms.

The minimal sum of products form for F is

1
2
3
4
Go to Discussion

Solution

Qus : 19

The Boolean expression represented by the following Venn diagram is

1
2
3
4
Go to Discussion

Solution

Phrases

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Phrases

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Feedback

Info.

Information

Aspire's Library

Phrases Previous Year Questions (PYQs)

Phrases Boolean Algebra PYQ

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Phrases

Phrases

Info.

Confirm Delete

Edit